Fast Approximate Solution Algorithm for Distribution System Expansion Planning
نویسندگان
چکیده
منابع مشابه
DG integrated multistage distribution system expansion planning
In this paper, a framework is presented to solve the problem of multistage distribution system expansion planning in which installation and/or reinforcement of substations, feeders and distributed generation units are taken into consideration as possible solutions for system capacity expansion. The proposed formulation considers investment, operation, and outage costs of the system. The expansi...
متن کاملA New Particle-Swarm-Based Algorithm for Distribution System Expansion Planning Including Distributed Generation
Distributed Generation (DG) is a new approach in the electricity industry to meet the electrical demand growth in a suitable manner. This paper presents a solution method for the distribution expansion panning problem including DG. The proposed algorithm is based on binary particle swarm optimization. The aim of the model is to find the optimal planning of the expansion to meet the load growth....
متن کاملA New Generation Allocation and Expansion Planning Algorithm Including Transmission System Effects
Generation Expansion Planning (GEP) is one of major modules of power system planning studies, normally performed for the nex 10-30 years horizon. The current industrial practices are to find the generation requirements based on a nodal analysis. In this way, the allocations are not determined and subequent studies are required to find the exact locations which as decomposed from the earli...
متن کاملToward a Smart Distribution System Expansion Planning by Considering Demand Response Resources
This paper presents a novel concept of "smart distribution system expansion planning (SDEP)" which expands the concept of demand response programs to be dealt with the long term horizon time. The proposed framework, integrates demand response resources (DRRs) as virtual distributed generation (VDG) resources into the distribution expansion planning. The main aim of this paper is to develop and ...
متن کاملDynamic Programming for Approximate Expansion Algorithm
Expansion algorithm is a popular optimization method for labeling problems. For many common energies, each expansion step can be optimally solved with a min-cut/max flow algorithm. While the observed performance of max-flow for the expansion algorithm is fast, its theoretical time complexity is worse than linear in the number of pixels. Recently, Dynamic Programming (DP) was shown to be useful ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Power and Energy
سال: 1990
ISSN: 0385-4213,1348-8147
DOI: 10.1541/ieejpes1990.110.11_929